On-Demand Index for Efficient Structural Joins

نویسندگان

  • Kun-Lung Wu
  • Shyh-Kwei Chen
  • Philip S. Yu
چکیده

An efficient indexing scheme for moving objects' trajectories on road networks p. 13 Spatial index compression for location-based services based on a MBR semi-approximation scheme p. 26 KCAM : concentrating on structural similarity for XML fragments p. 36 A new structure for accelerating XPath location steps p. 49 Efficient evaluation of multiple queries on streamed XML fragments p. 61 Automated extraction of hit numbers from search result pages p. 73 Keyword extraction using support vector machine p. 85 LSM : language sense model for information retrieval p. 97 Succinct and informative cluster descriptions for document repositories p. 109 LRD : latent relation discovery for vector space expansion and information retrieval p. 122 Web image retrieval refinement by visual contents p. 134 An effective approach for hiding sensitive knowledge in data publishing p. 146 Tracking network-constrained moving objects with group updates p. 158 Dynamic configuring service on semantic grid p. 170 Object placement and caching strategies on AN.P2P p. 182 Role-based peer-to-peer model : capture global pseudonymity for privacy protection p. 193 A reputation management scheme based on global trust model for peer-to-peer virtual communities p. 205 QoS-aware Web services composition using transactional composition operator p. 217 Optimizing the profit of on-demand multimedia service via a server-dependent queuing system p. 229 Service matchmaking based on semantics and interface dependencies p. 240 Crawling Web pages with support for client-side dynamism p. 252 RecipeCrawler : collecting recipe data from WWW incrementally p. 263 CCWrapper : adaptive predefined schema guided Web extraction p. 275 MiniTasking : improving cache performance for multiple query workloads p. 287 Cache consistency in mobile XML databases p. 300 Bulkloading updates for moving objects p. 313 Finding the plateau in an aggregated time series p. 325 Compressing spatial and temporal correlated data in wireless sensor networks based on ring topology p. 337 Discovery of temporal frequent patterns using TFP-tree p. 349 DGCL : an efficient density and grid based clustering algorithm for large spatial database p. 362 Scalable clustering using graphics processors p. 372 TreeCluster : clustering results of keyword search over databases p. 385 A new method for finding approximate repetitions in DNA sequences p. 397 Dynamic incremental data summarization for hierarchical clustering p. 410 Classifying E-mails via support vector machine p. 422

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Indexing Schemes for Efficient Aggregate Computation over Structural Joins

With the increasing popularity of XML as a standard for data representation and exchange, efficient XML query processing has become a necessity. One popular approach encodes the hierarchical structure of XML data through a node numbering scheme, thus reducing typical queries to special forms (structural, path, twig) of containment joins. In this paper we consider how using an index can facilita...

متن کامل

PERFORMANCE BASED DESIGN OPTIMIZATION OF STEEL MOMENT RESISTING FRAMES INCORPORATING SEISMIC DEMAND AND CONNECTION PARAMETERS UNCERTAINTIES

One of the most important problems discussed recently in structural engineering is the structural reliability analysis considering uncertainties. To have an efficient optimization process for designing a safe structure, firstly it is required to study the effects of uncertainties on the seismic performance of structure and then incorporate these effects on the optimization process. In this stud...

متن کامل

Fast Structural Join with a Location Function

A structural join evaluates structural relationship (parentchild or ancestor-descendant) between xml elements. It serves as an important computation unit in xml pattern matching, such as twig joins. There exists many work on efficient structural joins. In particular, indexes can expedite structural joins by skipping unmatchable elements. A typical use of indexes is to retrieve, for a given elem...

متن کامل

Skipping Strategies for Efficient Structural Joins

The structural join is considered a core operation in processing and optimizing XML queries. Various techniques have been proposed for efficiently finding structural relationships between a list of potential ancestors and a list of potential descendants. This paper presents a novel algorithm for efficiently processing structural joins. Moreover, previous work which performs well usually relies ...

متن کامل

Efficient Structural Joins on Indexed XML Documents

Queries on XML documents typically combine selections on element contents, and, via path expressions, the structural relationships between tagged elements. Structural joins are used to find all pairs of elements satisfying the primitive structural relationships specified in the query, namely, parent–child and ancestor– descendant relationships. Efficient support for structural joins is thus the...

متن کامل

Holistic Twig Joins on Indexed XML Documents

Finding all the occurrences of a twig pattern specified by a selection predicate on multiple elements in an XML document is a core operation for efficient evaluation of XML queries. Holistic twig join algorithms were proposed recently as an optimal solution when the twig pattern only involves ancestordescendant relationships. In this paper, we address the problem of efficient processing of holi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006